WORST_CASE(?,O(n^2))

Solution:
---------

  "c" :: ["A"(1, 0) x "A"(0, 0)] -(0)-> "A"(1, 0)
  "c" :: ["A"(0, 0) x "A"(1, 0)] -(0)-> "A"(0, 1)
  "f" :: ["A"(1, 0)] -(0)-> "A"(0, 0)
  "g" :: ["A"(0, 1)] -(0)-> "A"(0, 0)
  "s" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0)


Cost Free Signatures:
---------------------

  "c" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "f" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "g" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)


Base Constructors:
------------------